Sorting with Unreliable Comparisons: a Probabilistic Analysis
نویسندگان
چکیده
We provide a probabilistic analysis of the output of Quicksort when comparisons can err.
منابع مشابه
Quicksort with Unreliable Comparisons: A Probabilistic Analysis
We provide a probabilistic analysis of the output of Quicksort when comparisons can err.
متن کاملA general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms
We describe a general framework for realistic analysis of sorting and searching algorithms, and we apply it to the average-case analysis of five basic algorithms: three sorting algorithms (QuickSort, InsertionSort, BubbleSort) and two selection algorithms (QuickMin and SelectionMin). Usually, the analysis deals with the mean number of key comparisons, but, here, we view keys as words produced b...
متن کاملComputing with unreliable resources: design, analysis and algorithms
This thesis is devoted to the study of computing with unreliable resources, a paradigm emerging in a variety of technologies, such as circuit design, cloud computing, and crowdsourcing. In circuit design, as we approach the physical limits, semiconductor fabrication has been increasingly susceptible to fabrication flaws, resulting unreliable circuit components. In cloud computing, due to co-hos...
متن کاملSort well with energy-constrained comparisons
We study very simple sorting algorithms based on a probabilistic comparator model. In our model, errors in comparing two elements are due to (1) the energy or effort put in the comparison and (2) the difference between the compared elements. Such algorithms keep comparing pairs of randomly chosen elements, and they correspond to Markovian processes. The study of these Markov chains reveals an i...
متن کاملTSSort: Probabilistic Noise Resistant Sorting
In this paper we present TSSort, a probabilistic, noise resistant, quickly converging comparison sort algorithm based on Microsoft TrueSkill. The algorithm combines TrueSkill’s updating rules with a newly developed next item pair selection strategy, enabling it to beat standard sorting algorithms w.r.t. convergence speed and noise resistance, as shown in simulations. TSSort is useful if compari...
متن کامل